Novel Quantum Algorithms to Minimize Switching Functions Based on Graph Partitions

After Google reported its realization of quantum supremacy, Solving the classical problems with computing is becoming a valuable research topic. Switching function minimization an important problem in Electronic Design Automation (EDA) and logic synthesis, most solutions are based on heuristic algorithms computer, it good practice to solve this processer. In paper, we introduce new hybrid classic algorithm using Grover’s symmetric functions minimize small Disjoint Sum Product (DSOP) (SOP) for Boolean switching functions. Our method graph partitions arbitrary graphs regular graphs, which can be solved by Grover-based searching proposed. The Oracle built from implemented Lattice diagrams. It shown analytically verified simulations simulator that our methods find all these problems.